Aiming at unavailability and unreliability of net-flow fingerprint caused by net-flow transformation and network jitter, a semi-fragile net-flow fingerprint coding scheme based on adaptive net-flow characteristic (ACSF) was proposed. Firstly, ACSF generated Hash Message Authentication Code (HMAC) encryption key, determined HMAC scrambling method and chose the initial phase of the Pseudo-Noise (PN) code in accordance with net-flow characteristic parameters.The space of secret key was enlarged to O((k+1)·(S·O(KEN))), so as to increase computational complexity of compromising. Besides, net-flow fingerprint was made to have the capability of self-adaption. It decreased the computational complexity of decoder to O(k2·l·nf), which enhanced the efficiency of decoding. Secondly, in order to be semi-fragile net-flow fingerprint, Direct Sequence Spread Spectrum (DSSS) was used to filter non-malicious disposing. It can reach more than 90% correctness under the condition of 66.7% multi-flow disturbance rate. Besides, HMAC was used to locate malicious tamper, which could correctly locate malicious tamper at least 98.3%. Finally, the security, accuracy of tamper localization and resisting disturbance capability of ACSF were analyzed and verified by experiments.
Detecting sensitive information on terminal documents becomes extremely important due to the potential risk of sensitive information leakage. In order to resolve the problems of imprecise document model caused by context-free index and inadequate semantic extension, firstly, a context-sensitive document smoothing algorithm was proposed to build document index, which can retain much more document information; secondly, combining the sensitivity of concept in the domain ontology, semantic extension was improved to expand the detection range of sensitive information; finally, document smoothing and query expansion were integrated into the language model, and a sensitive information detection approach based on the language model was proposed. Comparative experiments on four approaches using different index mechanisms, query expansion algorithms and detection models, the recall, precision and F-Measure of the proposed approach were 0.798, 0.786 and 0.792 respectively, and the various performance indicators were obviously better than the compared algorithms. The experimental results show that the proposed approach is a more effective one.
In view of the problem that verifying the conformance of e-government network structure, a conformance verification method for e-government network based on graph approximate matching was proposed. The method firstly abstracted the graph model of e-government network, then used the modular characteristic of network structure and k-hop neighboring relationship of vertices to realize extendible approximate graph matching which got all the similar structures between the two graphs. And then it proposed an improved graph similarity measure function by introducing the node importance factor and path distance attenuation factor so as to make the conformity assessment results more accurate. The experimental result shows that the method can accurately evaluate the conformance degree of e-government network structure, and fine-grainedly reflect the similarities or differences between the network structures which include all kinds of violations in the network topology and system deployment.